A Lattice Orthogonalization Technique for Integrated Square Error Minimization
ثبت نشده
چکیده
Abshact-A recursive integrated square error minimization technique is developed to solve integral equations occurring in electromagnetic scattering problems. The underlying idea is a generalization of the concept of the second minimization step recently proposed by van den Berg. This is implemented by a structured latfice algorithm similar to the lattice algorithms which emerged in the iast decade in signal processing theory.
منابع مشابه
Optimum Block Size in Separate Block Bootstrap to Estimate the Variance of Sample Mean for Lattice Data
The statistical analysis of spatial data is usually done under Gaussian assumption for the underlying random field model. When this assumption is not satisfied, block bootstrap methods can be used to analyze spatial data. One of the crucial problems in this setting is specifying the block sizes. In this paper, we present asymptotic optimal block size for separate block bootstrap to estimate the...
متن کاملA Novel Equivalent Wiener-Hopf Equation with TDL coefficient in Lattice Structure
— In this paper, we propose an equivalent Wiener-Hopf equation. The proposed algorithm can obtain the weight vector of a TDL(tapped-delay-line) filter and the error simultaneously if the inputs are orthogonal to each other. The equivalent Wiener-Hopf equation was analyzed theoretically based on the MMSE(minimum mean square error) method. The results present that the proposed algorithm is equiva...
متن کاملA Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding
Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...
متن کاملA General Orthogonalization Technique With Applications to Time Series Analysis
A new orthogonalization technique is presented for computing the QR factorization of a general n X p matrix of full rank p (n > p). The method is based on the use of projections to solve increasingly larger subproblems recursively and has an 0(np2) operation count for general matrices. The technique is readily adaptable to solving linear least-squares problems. If the initial matrix has a circu...
متن کاملChemical Library Subset Selection Algorithms: A Unified Derivation Using Spatial Statistics
If similar compounds have similar activity, rational subset selection becomes superior to random selection in screening for pharmacological lead discovery programs. Traditional approaches to this experimental design problem fall into two classes: (i) a linear or quadratic response function is assumed (ii) some space filling criterion is optimized. The assumptions underlying the first approach a...
متن کامل